Temporal logic with accessibility temporal relations generated by time states themselves
نویسندگان
چکیده
منابع مشابه
Jointly Identifying Temporal Relations with Markov Logic
Recent work on temporal relation identification has focused on three types of relations between events: temporal relations between an event and a time expression, between a pair of events and between an event and the document creation time. These types of relations have mostly been identified in isolation by event pairwise comparison. However, this approach neglects logical constraints between ...
متن کاملDistributed States Temporal Logic
We introduce a temporal logic to reason on global applications in an asynchronous setting. First, we define the Distributed States Logic (DSL), a modal logic for localities that embeds the local theories of each component into a theory of the distributed states of the system. We provide the logic with a sound and complete axiomatization. The contribution is that it is possible to reason about p...
متن کاملTime window temporal logic
This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Eff...
متن کاملContinuous time temporal logic with counting
We add to the standard temporal logic TL(U,S) a sequence of “counting modalities”: For each n the modality Cn(X), which says that X will be true at least at n points in the next unit of time, and its dual ←− C n, which says that X has happened n times in the last unit of time. We show that this temporal logic is expressively complete for the metric predicate logic Q2MLO, which is expressive, de...
متن کاملAlternating-time Temporal Logic with Explicit Programs
We introduce ATLEP, an extension of Alternating-time Temporal Logic (ATL), following the recent Alternating-time Temporal Logic with Explicit Actions (ATLEA). ATLEP adds to the language of ATL explicit programs whose agents are committed to play, formulated in an extension of Propositional Dynamic Logic (PDL) where strategies can be captured. We add combinations of commitments, inspired from th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sibirskie Elektronnye Matematicheskie Izvestiya
سال: 2020
ISSN: 1813-3304
DOI: 10.33048/semi.2020.17.068